-
1 undirected graph
неориентированный граф
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > undirected graph
-
2 undirected graph
т. граф. неориентированный [ненаправленный\] граф (граф, в котором связь между вершинами не имеет направления)Syn:Ant:See: -
3 undirected graph
-
4 undirected graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
English-Russian big polytechnic dictionary > undirected graph
-
5 undirected graph
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > undirected graph
-
6 undirected graph
Большой англо-русский и русско-английский словарь > undirected graph
-
7 undirected graph
Англо-русский словарь технических терминов > undirected graph
-
8 undirected graph
неориентированный графАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > undirected graph
-
9 undirected graph
1) Техника: неориентированный граф2) Макаров: ненаправленный граф -
10 undirected graph
-
11 undirected graph
-
12 undirected graph
-
13 undirected graph
The New English-Russian Dictionary of Radio-electronics > undirected graph
-
14 undirected graph
English-Russian dictionary of computer science and programming > undirected graph
-
15 undirected graph
-
16 undirected graph
неориентированный графEnglish-Russian dictionary of technical terms > undirected graph
-
17 undirected graph
-
18 undirected graph
English-Russian dictionary of computer science > undirected graph
-
19 undirected graph
English-Russian dictionary of electronics > undirected graph
-
20 associated undirected graph
Электроника: соотнесённый неориентированный графУниверсальный англо-русский словарь > associated undirected graph
См. также в других словарях:
undirected graph — neorientuotasis grafas statusas T sritis automatika atitikmenys: angl. undirected graph vok. ungerichteter Graph, m rus. неориентированный граф, m pranc. graphe non orienté, m … Automatikos terminų žodynas
undirected graph — noun A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a). Syn: graph Ant: directed graph … Wiktionary
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Graph automorphism — In graph theoretical mathematics, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge vertex connectivity.Formally, an automorphism of a graph G = ( V , E ) is a permutation sigma;… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
graph theory — A branch of mathematics used to represent relations and networks. A graph consists of a set of points (nodes or vertices) and the pairwise links between them (arcs or lines). In sociological applications, the nodes are typically individuals,… … Dictionary of sociology
graph — 1. noun /ɡɹɑːf,ɡɹæf/ a) A diagram displaying data; in particular one showing the relationship between two or more quantities, measurements or indicative numbers that may or may not have a specific mathematical formula relating them to each other … Wiktionary
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Graph isomorphism — In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly… … Wikipedia
undirected path — noun In a directed graph, a path in which the edges are not all oriented in the same direction. A path x rarr;y larr;z is an undirected path. Ant: directed path … Wiktionary
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia